Exact Sampling of Stationary and Time-Reversed Queues

Analysis of discrete time queues via the reversed process

A class of discrete-time M=G=1 queues, including both round robin and last come rst served service, in which customers are subject to permutations is considered. These time slotted queues, analogous to the symmetric queues of Kelly, are analyzed by examination of the time reversed process. Product form stationary distributions are found for a type of doubly stochastic server of Schassberger [5]...

stationary single-server queues

This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...

Stability and Non-Stationary Characteristics of Queues

Sensitivity Analysis for Stationary and Ergodic Queues

Starting with some mild assumptions on the parametrization of the service process, perturbation analysis (PA) estimates are obtained for stationary and ergodic single server queues. Besides relaxing the stochastic assumptions, our approach solves some problems associated with the traditional regenerative approach taken in most of the previous work in this area. First, it avoids problems caused ...

Approximate analysis of non-stationary loss queues and networks of loss queues with general service time distributions

Article history: Received 7 June 2010 Accepted 13 March 2011 Available online 21 March 2011